hTetro-Infi: A Reconfigurable Floor Cleaning Robot With Infinite Morphologies
نویسندگان
چکیده
منابع مشابه
Tackling Area Coverage Problems in a Reconfigurable Floor Cleaning Robot Based on Polyomino Tiling Theory
Whilst Polyomino tiling theory has been extensively studied as a branch of research in mathematics, its application has been largely confined to multimedia, graphics and gaming domains. In this paper, we present a novel application of Tromino tiling theory, a class of Polyomino with three cells in the context of a reconfigurable floor cleaning robot, hTromo. The developed robot platform is able...
متن کاملOptimization of Floor Cleaning Coverage Performance of a Random Path-Planning Mobile Robot
Floor cleaning is a typical mobile robot application. Most commercial cleaning mobile robots designed for domestic applications use random path-planning algorithms and very few sensors and the critical problem is to decide when the cleaning is already finished or the coverage completed. In this work, we have simulated and modeled the evolution of the area cleaned by the robot and demonstrate it...
متن کاملDesign of a Type of Cleaning Robot with Ultrasonic
A cleaning robot based on the ultrasonic principle is designed. With the single chip microcomputer AT89C52 and ultrasonic sensors, the robot can achieve the function of intelligent obstacle avoidance, automatic control and automatic sweeping. In the cleaning robot, a rotating cylindrical brush is used in front of the robot and it sweeps garbages into the dustbin in the process of movement, and ...
متن کاملSelf-Reconfigurable Modular Robot
We have proposed a self-reconfigurable robotic module, which has a very simple structure. The system is capable of not only building static structure but generating dynamic robotic motion. We also developed a simulator for motion planning. In this paper, we present details of the mechanical / electrical design of the developed module and its control system architecture. Experiments using ten mo...
متن کاملRobot trajectory planning with semi-infinite programming
In this paper we describe how robot trajectory planning can be formulated as a semi-infinite programming (SIP) problem. The formulation as a SIP problem allowed us to treat the problem with one of the three main classes of methods for solving SIP, the discretization class. Two of the robotics trajectory planning problems formulated were coded in the SIPAMPL [1] environment which is publicly ava...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2986838